The Complete Solution of Decompositionof Complete Graph into Three Factorswith Diameter

Complete Growth Series of Coxeter Groups with more than Three Generators

Decomposition of complete graphs into factors of diameter two and three

We analyze a minimum number of vertices of a complete graph that can be decomposed into one factor of diameter 2 and k factors of diameter at most 3. We find exact values for k ≤ 4 and the asymptotic value of the ratio of this number and k when k tends to infinity. We also find the asymptotic value of the ratio of the number of vertices of the smallest complete graph that can be decomposed into...

Factorizations of the complete graphs into factor of subdiameter two and factors of diameter three

We search for the minimal number of vertices of the complete graph that can be decomposed into one factor of subdiameter 2 and k factors of diameter 3. We find as follows: exact values for k ≤ 3, upper and lower bounds for small values of k and lim k→∞ φ (k) k = 2.

تأثیر زمان غوطه‌وری سوخ در غلظت‌های مختلف کود کامل NPK بر صفات کمی و کیفی گل مریم (Polianthes tuberosa L. cv. Double)

To evaluate the effect of dipping time of bulb in complete NPK fertilizer on quantitative and qualitative traits of tuberose (Polianthes tuberosa L. cv. Double), a factorial experiment based on completely randomized design with four replications was conducted under the greenhouse conditions. The first factor was three bulb-dipping times (20, 40 and 60 min) and the second factor was four concent...

Decompositions of Complete Graphs into Factors with Diameter Two

In the present paper the question is studied from three points of vieAv whether to any natural number k _> 2 there exists a complete graph decomposable into k factors with diameters two . The affirmative answer to this question is given and some estimations for the minimal possible number of vertices of such a complete graph are deduced . As a corollary it follows that given k diameters di, d2 ...